A New Proof for the Monte Carlo Constructibility of Log Log N
نویسنده
چکیده
The Monte Carlo constructibility of log logn has proved by Karpinski and Verbeek ([KV87]). They proposed an algorithm, and proved the constructibility by applying a statistical result in [Fel57] to the algorithm. We give a new algorithm, and prove the constructibility by analyzing the algorithm.
منابع مشابه
Hyperbolic Cosine Log-Logistic Distribution and Estimation of Its Parameters by Using Maximum Likelihood Bayesian and Bootstrap Methods
In this paper, a new probability distribution, based on the family of hyperbolic cosine distributions is proposed and its various statistical and reliability characteristics are investigated. The new category of HCF distributions is obtained by combining a baseline F distribution with the hyperbolic cosine function. Based on the base log-logistics distribution, we introduce a new di...
متن کاملFast Monte-Carlo Primality Evidence Shown in the Dark
We construct an e cient proof of knowledge protocol for the demonstration of Monte-Carlo evidence that a number n is the product of two odd primes of roughly equal size without the prime factors being disclosed. The cost for a proof amounts to 12k log 2 n multiplications of integers of size of n where k is a security parameter which controls the error probability of the proof under 2 . With the...
متن کاملBootstrap confidence intervals of CNpk for type‑II generalized log‑logistic distribution
This paper deals with construction of confidence intervals for process capability index using bootstrap method (proposed by Chen and Pearn in Qual Reliab Eng Int 13(6):355–360, 1997) by applying simulation technique. It is assumed that the quality characteristic follows type-II generalized log-logistic distribution introduced by Rosaiah et al. in Int J Agric Stat Sci 4(2):283–292, (2008). Discu...
متن کاملOn Learning Graphs with Edge-Detecting Queries
We consider the problem of learning a general graph G = (V,E) using edge-detecting queries, where the number of vertices |V | = n is given to the learner. The information theoretic lower bound gives m log n for the number of queries, where m = |E| is the number of edges. In case the number of edges m is also given to the learner, Angluin-Chen’s Las Vegas algorithm Angluin and Chen (2008) runs i...
متن کاملBayesian Analysis of Censored Spatial Data Based on a Non-Gaussian Model
Abstract: In this paper, we suggest using a skew Gaussian-log Gaussian model for the analysis of spatial censored data from a Bayesian point of view. This approach furnishes an extension of the skew log Gaussian model to accommodate to both skewness and heavy tails and also censored data. All of the characteristics mentioned are three pervasive features of spatial data. We utilize data augme...
متن کامل